// GL && HF
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
const int inf = 1 << 30;

int n, r[100010], cnt;
bool b[100010];

int main() {
    freopen("duel.in", "r", stdin);
    freopen("duel.out", "w", stdout);

    scanf("%d", &n);
    for (int i = 1; i <= n; i++) {
        scanf("%d", &r[i]);
    }
    sort(r + 1, r + n + 1);
    int p = 1;
    for (int i = 1; i <= n; i++) {
        while (p <= n + 1 && (b[p] || r[p] <= r[i])) ++p;
        if (p <= n) b[i] = true;
        ++p;
    }
    for (int i = 1; i <= n; i++)
        if (!b[i])
            cnt++;
    printf("%d\n", cnt);
    return 0;
}
